Vertex-disjoint copies of K1,t in K1,r-free graphs
نویسندگان
چکیده
منابع مشابه
Vertex-disjoint copies of K4- in graphs
Let K− 4 denote the graph obtained from K4 by removing one edge. Let k be an integer with k ≥ 2. Kawarabayashi conjectured that if G is a graph of order n ≥ 4k + 1 with σ2(G) ≥ n + k, then G has k vertex-disjoint copies of K− 4 . In this paper, we settle this conjecture affirmatively.
متن کاملVertex-Disjoint Copies of K1 + (K1 ∪K2) in Graphs
Let S denote the graph obtained from K4 by removing two edges which have an endvertex in common. Let k be an integer with k ≥ 2. Let G be a graph with |V (G)| ≥ 4k and σ2(G) ≥ |V (G)|/2 + 2k− 1, and suppose that G contains k vertex-disjoint triangles. In the case where |V (G)| = 4k+2, suppose further that G K4t+3 ∪ K4k−4t−1 for any t with 0 ≤ t ≤ k − 1. Under these assumptions, we show that G c...
متن کاملVertex-disjoint Copies of K
Let G be a graph of order n. Let K− l be the graph obtained from Kl by removing one edge. In this paper, we propose the following conjecture: Let G be a graph of order n ≥ lk with δ(G) ≥ (n−k+1) l−3 l−2 +k−1. Then G has k vertex-disjoint K− l . This conjecture is motivated by Hajnal and Szemerédi’s [6] famous theorem. In this paper, we verify this conjecture for l = 4.
متن کاملVertex disjoint cycles for star free graphs
A graph is claw-free if it does not contain K I ,3 as an induced subgraph. A graph is KI,r-free if it does not contain KI,r as an induced subgraph. In this paper, we find bounds on the minimum number of edges needed to ensure a KI,.,.-free contains k vertex disjoint cycles. The bound on claw-free graphs is sharp.
متن کاملVertex-Disjoint Stars in Graphs
In this paper, we give a sufficient condition for a graph to contain vertex-disjoint stars of a given size. It is proved that if the minimum degree of the graph is at least k + t − 1 and the order is at least (t + 1)k + O(t), then the graph contains k vertex-disjoint copies of a star K1,t. The condition on the minimum degree is sharp, and there is an example showing that the term O(t) for the n...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Mathematics
سال: 2017
ISSN: 0012-365X
DOI: 10.1016/j.disc.2016.11.034